Parallel Huffman Decoding with Applications to JPEG Files

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Parallel Huffman Decoding with Applications to JPEG Files

A simple parallel algorithm for decoding a Huffman encoded file is presented, exploiting the tendency of Huffman codes to resynchronize quickly, i.e. recovering after possible decoding errors, in most cases. The average number of bits that have to be processed until synchronization is analyzed and shows good agreement with empirical data. As Huffman coding is also a part of the JPEG image compr...

متن کامل

Parallel Huffman Decoding

A simple parallel algorithm for decoding a Huuman encoded le is presented , exploiting the tendency of Huuman codes to resynchronize quickly in most cases. An extention to JPEG decoding is mentioned.

متن کامل

High Speed Pipelined Parallel Huffman Decoding

This paper introduces a new class of Huffman decoders which is a developmet of the parallel Huffman decoder model. With pipelining and partitioning, a regular architecture with an arbitrary degree of pipelining is developed. The proposed architecture dramatically reduces the symbol decoder requirements compared to previous results, and still is the actual implementation of the symbol decoder no...

متن کامل

Partitioning Files for Huffman Encoding

When the relative frequencies of characters vary significantly within a single file, it may be desirable to use a different Huffman code on different phases of the file. This note presents an heuristic algorithm for determining the boundaries between phases. l. Introduction Huffman encoding [3J is a well-known technique for data compression. The "standard" algorithm works off-line. Its first pa...

متن کامل

Quality Adaptive Low-Rank Based JPEG Decoding with Applications

Small compression noises, despite being transparent to human eyes, can adversely affect the results of many image restoration processes, if left unaccounted for. Especially, compression noises are highly detrimental to inverse operators of high-boosting (sharpening) nature, such as deblurring and superresolution against a convolution kernel. By incorporating the non-linear DCT quantization mech...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: The Computer Journal

سال: 2003

ISSN: 0010-4620,1460-2067

DOI: 10.1093/comjnl/46.5.487